Computational Properties of Qualitative Spatial Reasoning: First Results
نویسنده
چکیده
While the computational properties of qualitative temporal reasoning have been analyzed quite thoroughly, the computational properties of qualitative spatial reasoning are not very well investigated. In fact, almost no completeness results are known for qualitative spatial calculi and no computational complexity analysis has been carried out yet. In this paper, we will focus on the so-called RCC approach and use Bennett's encoding of spatial reasoning in intuitionistic logic in order to show that consistency checking for the topological base relations can be done eeciently. Further, we show that path-consistency is suucient for deciding global consistency. As a side-eeect we prove a particular fragment of propositional intuitionistic logic to be tractable.
منابع مشابه
Extending the Qualitative Trajectory Calculus Based on the Concept of Accessibility of Moving Objects in the Paths
Qualitative spatial representation and reasoning are among the important capabilities in intelligent geospatial information system development. Although a large contribution to the study of moving objects has been attributed to the quantitative use and analysis of data, such calculations are ineffective when there is little inaccurate data on position and geometry or when explicitly explaining ...
متن کاملSpatial Symmetry Driven Pruning
Declarative spatial reasoning denotes the ability to (declaratively) specify and solve real-world problems related to geometric and qualitative spatial representation and reasoning within standard knowledge representation and reasoning (KR) based methods (e.g., logic programming and derivatives). One approach for encoding the semantics of spatial relations within a declarative programming frame...
متن کاملA Hybrid Geometric-Qualitative Spatial Reasoning System and Its Application in GIS
We propose a hybrid geometric-qualitative spatial reasoning system that is able to simultaneously deal with input information that is partially given geometrically and partially qualitatively using spatial relations of different qualitative spatial calculi. The reasoning system combines a geometric reasoning component based on computational geometry methods with a qualitative reasoning componen...
متن کاملOn the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection
The computational properties of qualitative spatial reasoning have been investigated to some degree. However, the question for the boundary between polynomial and NP-hard reasoning problems has not been addressed yet. In this paper we explore this boundary in the \Region Connection Calculus" RCC-8. We extend Bennett's encoding of RCC-8 in modal logic. Based on this encoding, we prove that reaso...
متن کاملOn the Complexity of Qualitative Spatial Reasoning : A Maximal Tractable Fragment of RCC-8
The computational properties of qualitative spatial reasoning have been investigated to some degree . However, the question for the boundary between polynomial and NP-hard reasoning problems has not been addressed yet . In this paper we explore this boundary in the "Region Connection Calculus" RCC-8. We extend Bennett's encoding of RCC-8 in modal logic. Based on this encoding, we prove that rea...
متن کامل